Constructions Over Tournaments
نویسندگان
چکیده
منابع مشابه
Constructions over Tournaments
We investigate tournaments that are projective in the variety that they generate, and free algebras over partial tournaments in that variety. We prove that the variety determined by three-variable equations of tournaments is not locally finite. We also construct infinitely many finite, pairwise incomparable simple tournaments.
متن کاملBounds and constructions for n-e.c. tournaments
Few families of tournaments satisfying the n-e.c. adjacency property are known. We supply a new random construction for generating infinite families of vertex-transitive n-e.c. tournaments by considering circulant tournaments. Switching is used to generate new ne.c. tournaments of certain orders. With aid of a computer search, we demonstrate that there is a unique minimum order 3-e.c. tournamen...
متن کاملGeneralizing over Quantitative and Qualitative Constructions
The syntax of these constructions has received a lot of attention in recent years (den Dikken 1995, 1998, Español-Echevarría 1996, Hulk & Tellier 1999ab, Doetjes 1997). However, very little work has concentrated on the relation between both constructions. Milner (1978) had already observed that quantitative and qualitative constructions share the same syntactic structure (see also Ruwet 1982). ...
متن کاملConstructions of Subsystem Codes over Finite Fields
Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. Subsystem codes generalize all major quantum error protection schemes, and therefore are especially versatile. This paper introduces numerous constructions of subsystem codes. It is shown how one can derive subsystem codes from classical cyclic codes. Methods to trade the dim...
متن کاملLocal Tournaments and In - Tournaments
Preface Tournaments constitute perhaps the most well-studied class of directed graphs. One of the reasons for the interest in the theory of tournaments is the monograph Topics on Tournaments [58] by Moon published in 1968, covering all results on tournaments known up to this time. In particular, three results deserve special mention: in 1934 Rédei [60] proved that every tournament has a directe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2003
ISSN: 0011-4642,1572-9141
DOI: 10.1023/a:1026295622413